Factorization tables for trinomials over $\mathrm{GF}(q)$
نویسندگان
چکیده
منابع مشابه
Factorization of Trinomials over Galoisfields
We study the parity of the number of irreducible factors of trinomials over Galois elds of characteristic 2. As a consequence , some suucient conditions for a trinomial being reducible are obtained. For example, x n + ax k + b 2 GF (2 t))x] is reducible if both n; t are even, except possibly when n = 2k, k odd. The case t = 1 was treated by R.G.Swan 10], who showed that x n + x k + 1 is reducib...
متن کاملAn Algorithm for Generating Irreducible Cubic Trinomials over Prime Field
This paper proposes an algorithm for generating irreducible cubic trinomials in the form x + ax + b, b ∈ Fp, where a is a certain fixed non-zero element in the prime field Fp. The proposed algorithm needs a certain irreducible cubic trinomial over Fp to be previously given as a generator; however, the proposed algorithm can generate irreducible cubic polynomials one after another by changing a ...
متن کاملRoots of Trinomials over Prime Fields
The origin of this work was the search for a “Descartes’ rule” for finite fields a nontrivial upper bound for the number of roots of sparse polynomials. In [2], Bi, Cheng, and Rojas establish such an upper bound. Then, in [3], Cheng, Gao, Rojas, and Wan show that the bound is essentially optimal in an infinite number of cases by constructing t-nomials with many roots in Fpt . However, the bound...
متن کاملExtremal Trinomials over Quadratic Finite Fields
In the process of pursuing a finite field analogue of Descartes’ Rule, Bi, Cheng, and Rojas (2014) proved an upper bound of 2 √ q − 1 on the number of roots of a trinomial c1 + c2x a2 + c3x a3 ∈ Fq [x], conditional on the exponents satisfying δ = gcd(a2, a3, q − 1) = 1, and Cheng, Gao, Rojas, and Wan (2015) showed that this bound is near-optimal for many cases. Our project set out to refine the...
متن کاملRoot Separation for Trinomials
We give a separation bound for the complex roots of a trinomial f ∈ Z[X ]. The logarithm of the inverse of our separation bound is polynomial in the size of the sparse encoding of f ; in particular, it is polynomial in log(deg f). It is known that no such bound is possible for 4-nomials (polynomials with 4 monomials). For trinomials, the classical results (which are based on the degree of f rat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1976
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-76-99670-8